Separation metrics for real-valued random variables
نویسندگان
چکیده
منابع مشابه
Probability Generating Functions for Discrete Real Valued Random Variables
The probability generating function is a powerful technique for studying the law of finite sums of independent discrete random variables taking integer positive values. For real valued discrete random variables, the well known elementary theory of Dirichlet series and the symbolic computation packages available nowadays, such as Mathematica 5 TM, allows us to extend to general discrete random v...
متن کاملProbability on Finite Set and Real-Valued Random Variables
One can prove the following four propositions: (1) Let X be a non empty set, S1 be a σ-field of subsets of X, M be a σ-measure on S1, f be a partial function from X to R, E be an element of S1, and a be a real number. Suppose f is integrable on M and E ⊆ dom f and M(E) < +∞ and for every element x of X such that x ∈ E holds a ≤ f(x). Then R(a) ·M(E) ≤ ∫ f E dM. (2) Let X be a non empty set, S1 ...
متن کاملOn a quaternion valued Gaussian random variables
In the present note we show that Polya’s type characterization theorem of Gaussian distributions does not hold. This happens because in the linear form, constituted by the independent copies of quaternion random variables, a part of the quaternion coefficients is written on the right hand side and another part on the left side. This gives a negative answer to the question posed in [1]. Mathemat...
متن کاملProposition-valued random variables as information
The notion of a proposition as a set of possible worlds or states occupies central stage in probability theory, semantics and epistemology, where it serves as the fundamental unit both of information and meaning. But this fact should not blind us to the existence of prospects with a di¤erent structure. In the paper I examine the use of random variables in particular, proposition-valued random v...
متن کاملEquivalence of methods for uncertainty propagation of real-valued random variables
In this paper we compare four methods for the reliable propagation of uncertainty through calculations involving the binary operations of addition, multiplication, subtraction and division. The methods we investigate are: (i) dependency bounds convolution; (ii) Distribution Envelope Determination; (iii) interval probabilities; and (iv) Dempster–Shafer belief functions. We show that although eac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 1984
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171284000429